Non-preemptive priority scheduler with multiple thresholds for network routers

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Waiting times of the Multiple Priority Dual Queue with Finite Buffer and Non- Preemptive Priority Scheduling

This paper considers a novel queueing model called the Multi-Priority Dual Queue (MPDQ), which was introduced and analyzed in Bedford and Zeephongsekul [1, 2]. The MPDQ consists of two queues with a finite buffer, the primary and the secondary queue with the additional feature of a priority scheme to assist with congestion control and meeting Quality of Service ( ) QoS objectives for differenti...

متن کامل

A Photonic Container Switched OBS Architecture with Non- preemptive Centralized Scheduler for the Core Transport Network

We propose a new high-level OBS architecture based on photonic container switching to be deployed in the core network. Our architecture removes most of the complexities of the present day Optical Burst Switching (OBS) technology and makes possible an all-optical core network with zero packet loss guaranteeing equal QoS to all users. In the proposed architecture, the packets are actually packed ...

متن کامل

Enhanced core stateless fair queuing with multiple queue priority scheduler

The Core Stateless Fair Queuing (CSFQ) is a distributed approach of Fair Queuing (FQ). The limitations include its inability to estimate fairness during large traffic flows, which are short and bursty (VoIP or video), and also it utilizes the single FIFO queue at the core router. For improving the fairness and efficiency, we propose an Enhanced Core Stateless Fair Queuing (ECSFQ) with multiple ...

متن کامل

Non preemptive static priority in network calculus: accuracy and integration with P-GPS

The real-time behaviour of critical real-time systems relies on the real-time behaviour of the network and some method to compute bounds on the traversal time (worst case traversal time – WCTT). Network calculus (NC) is a method designed to compute such bounds, and one challenge is to have tight bounds, i.e. reaching the exact worst case, to avoid over-provisioning. In this paper, we present a ...

متن کامل

Multiple Network Interfaces Management for Mobile Routers

In recent years we have witnessed the development and the deployment of a multitude of wireless access networks, including IEEE 802.11a/b/g WLAN, IEEE 802.15 PAN, IEEE 802.20 MBWAN, or 3G WWAN. In this heterogeneous environment the IPv6 network layer is widely accepted as being the muchneeded convergence layer to accommodate various kinds of technologies. Thus, mobility management procedures ha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pamukkale University Journal of Engineering Sciences

سال: 2018

ISSN: 1300-7009,2147-5881

DOI: 10.5505/pajes.2017.74318